Chomsky-Schützenberger parsing for weighted multiple context-free languages
نویسندگان
چکیده
منابع مشابه
A Chomsky-Schützenberger Representation for Weighted Multiple Context-free Languages
We prove a Chomsky-Schützenberger representation theorem for weighted multiple context-free languages.
متن کاملChomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages
It is a well-known theorem by Chomsky and Schützenberger (1963) that every context-free language can be represented as a homomorphic image of the intersection of a Dyck language and a regular language. This paper gives a Chomsky-Schützenberger-type characterization for multiple context-free languages, which are a natural extension of context-free languages, with introducing the notion of multip...
متن کاملThe Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
Weighted automata model quantitative aspects of systems like the consumption of resources during executions. Traditionally, the weights are assumed to form the algebraic structure of a semiring, but recently also other weight computations like average have been considered. Here, we investigate quantitative context-free languages over very general weight structures incorporating all semirings, a...
متن کاملParsing CFGs and PCFGs with a Chomsky-Schützenberger Representation
We present a parsing algorithm for arbitrary context-free and probabilistic context-free grammars based on a representation of such grammars as a combination of a regular grammar and a grammar of balanced parentheses, similar to the representation used in the Chomsky-Schützenberger theorem. The basic algorithm has the same worst-case complexity as the popular CKY and Earley parsing algorithms f...
متن کاملParsing of Context Free Languages
Parsing is the process of assigning structure to sentences The structure is obtained from the grammatical description of the language Both in Com puter Science and in Computational Linguistics context free grammars and associated parsing algorithms are among the most useful tools Numerous parsing algorithms have been developed Special subclasses of the context free grammars have been introduced...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Language Modelling
سال: 2017
ISSN: 2299-8470,2299-856X
DOI: 10.15398/jlm.v5i1.159